A tower of paper spanning eighty years.
نویسنده
چکیده
منابع مشابه
TOWER CRANES AND SUPPLY POINTS LOCATING PROBLEM USING CBO, ECBO, AND VPS
Tower cranes are major and expensive equipment that are extensively used at building construction projects and harbors for lifting heavy objects to demand points. The tower crane locating problem to position a tower crane and supply points in a building construction site for supplying all requests in minimum time, has been raised from more than twenty years ago. This problem has already been so...
متن کاملThe number and degree distribution of spanning trees in the Tower of Hanoi graph
The number of spanning trees of a graph is an important invariant related to topological and dynamic properties of the graph, such as its reliability, communication aspects, synchronization, and so on. However, the practical enumeration of spanning trees and the study of their properties remain a challenge, particularly for large networks. In this paper, we study the number and degree distribut...
متن کاملCounting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کاملSOLVING A STEP FIXED CHARGE TRANSPORTATION PROBLEM BY A SPANNING TREE-BASED MEMETIC ALGORITHM
In this paper, we consider the step fixed-charge transportation problem (FCTP) in which a step fixed cost, sometimes called a setup cost, is incurred if another related variable assumes a nonzero value. In order to solve the problem, two metaheuristic, a spanning tree-based genetic algorithm (GA) and a spanning tree-based memetic algorithm (MA), are developed for this NP-hard problem. For compa...
متن کاملSierpiński graphs as spanning subgraphs of Hanoi graphs
Hanoi graphs Hn p model the Tower of Hanoi game with p pegs and n discs. Sierpiński graphs Sn p arose in investigations of universal topological spaces and have meanwhile been studied extensively. It is proved that Sn p embeds as a spanning subgraph into Hn p if and only if p is odd or, trivially, if n = 1. MSC: 05C60
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Revista de gastroenterologia de Mexico
دوره 80 2 شماره
صفحات -
تاریخ انتشار 2015